Using Algebraic Geometry for Multivariate Hermite Interpolation
نویسنده
چکیده
This paper uses some well known theorems of algebraic geometry to characterize polynomial Hermite interpolation in any dimension. Efficient numerical algorithms are presented for interpolatory curve fits through points in the plane, surface fits through points and curves in space, and in general, hypersuface fits through. points, curves, surfaces, and sub-varieties in n dimensional space. These interpolatory fits may also be made to match derivative information at the data points. ·Dedicated to Professor Samuel Conte ISupported in parl by NSF grant eCR 90-02228 and AFOSR contract 91-0276
منابع مشابه
A Solution to Inverse Interpolation in Computer Graphics
Inverse solutions to interpolation techniques in computer graphics may increase the accuracy of the rendered frames. An example is the use of an arbitrary time stamp in time interpolation to evaluate the t-parameter, which in turn can be used for time-variant spatial interpolation. In this paper, an analytic inverse is presented for a shape-preserving piecewise cubic Hermite interpolant, used i...
متن کاملgH-differentiable of the 2th-order functions interpolating
Fuzzy Hermite interpolation of 5th degree generalizes Lagrange interpolation by fitting a polynomial to a function f that not only interpolates f at each knot but also interpolates two number of consecutive Generalized Hukuhara derivatives of f at each knot. The provided solution for the 5th degree fuzzy Hermite interpolation problem in this paper is based on cardinal basis functions linear com...
متن کاملMulti-dimensional Hermite Interpolation and Approximation for Modelling and Visualization
In this paper we use some well known theorems of algebraic geometry in reducing polynomial Hermite interpolation and approximation in any dimension to the solution of linear systems. We present a mix of symbolic and numerical algorithms for low degree curve ts through points in the plane, surface ts through points and curves in space, and in general, hypersuface ts through points, curves, surfa...
متن کاملLower complexity bounds for interpolation algorithms
We introduce and discuss a new computational model for Hermite–Lagrange interpolation by nonlinear classes of polynomial interpolants. We distinguish between an interpolation problem and an algorithm that solves it. Our model includes also coalescence phenomena and captures a large variety of known Lagrange-Hermite interpolation problems and algorithms. Like in traditional Hermite–Lagrange inte...
متن کاملHermite Birkhoff interpolation of scattered data by combined Shepard operators
Methods approaching the problem of the Hermite Birkhoff interpolation of scattered data by combining Shepard operators with local interpolating polynomials are not new in literature [1–4]. In [3] combinations of Shepard operators with bivariate Hermite-Birkhoff local interpolating polynomials are introduced to increase the algebraic degree of precision (polynomial reproduction degree) of Shepar...
متن کامل